Weight enumerators, intersection enumerators and Jacobi polynomials II
نویسندگان
چکیده
In the present paper, we introduce concepts of Jacobi polynomials and intersection enumerators codes over Fq Zk for arbitrary genus g. We also discuss interrelation among them. Finally, give MacWilliams type identities polynomials.
منابع مشابه
Quantum Weight Enumerators
In a recent paper, Shor and Laflamme define two “weight enumerators” for quantum error-correcting codes, connected by a MacWilliams transform, and use them to give a linear-programming bound for quantum codes. We introduce two new enumerators which, while much less powerful at producing bounds, are useful tools nonetheless. The new enumerators are connected by a much simpler duality transform, ...
متن کاملExtended and generalized weight enumerators
This paper gives a survey on extended and generalized weight enumerators of a linear code and the Tutte polynomial of the matroid of the code [16]. Furthermore ongoing research is reported on the coset leader and list weight enumerator and its extensions using the derived code and its arrangement of hyperplanes.
متن کاملOn Some Polynomials Related to Weight Enumerators of Linear Codes
A linear code can be thought of as a vector matroid represented by the columns of the code’s generator matrix; a well-known result in this context is Greene’s theorem on a connection of the weight polynomial of the code and the Tutte polynomial of the matroid. We examine this connection from the coding-theoretic viewpoint, building upon the rank polynomial of the code. This enables us to obtain...
متن کاملQuantum Computation and Quadratically Signed Weight Enumerators
We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be cast in terms of promise problems and has two interesting variants. An oracle for the unconstrained variant may be more powerful than quantum computation, w...
متن کاملMacWilliams Identities for $m$-tuple Weight Enumerators
Since MacWilliams proved the original identity relating the Hamming weight enumerator of a linear code to the weight enumerator of its dual code there have been many different generalizations, leading to the development of m-tuple support enumerators. We prove a generalization of theorems of Britz and of Ray-Chaudhuri and Siap, which build on earlier work of Kløve, Shiromoto, Wan, and others. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2022
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.113098